Fully Secure PSI via MPC-in-the-Head
نویسندگان
چکیده
We design several new protocols for private set intersection (PSI) with active security: one the two party setting, and multi-party setting. In recent years, state-of-the-art PSI have all been built from OT-extension. This has led to extremely efficient that provide correct output party; seemingly inherent approach, however, is there no way relay result other a provable correctness guarantee. Furthermore, natural extend this line of works more parties. consider instantiation an older approach. Using MPC-in-the-head paradigm Ishai et al. [IPS08], we construct polynomial roots encode intersection, without revealing inputs. Our reliance on allows us base our protocol passively secure Oblivious Linear Evaluation (OLE) (requiring 4 such amortized calls per input element). Unlike state-ofthe-art prior work, implemented protocols, providing first benchmarks provides Additionally, present variant only central server.
منابع مشابه
Passively Secure MPC
A t-out-of-n secret-sharing scheme allows an honest dealer D to distribute a secret s among n players, such that any subset of t players has no information about s, but every set of t + 1 players can collaboratively reconstruct the secret. The most famous secret-sharing scheme is Shamir’s Sharing Scheme [Sha79] (cf. Section 7.1.2). It uses polynomials to obtain the desired properties. Before pr...
متن کاملOptimally Hybrid-Secure MPC
Most protocols for multi-party computation (MPC) are secure either against information-theoretic (IT) or against computationally bounded adversaries. Hybrid-secure MPC protocols guarantee different levels of security, depending on the power of the adversary. We present a hybrid-secure MPC protocol that provides an optimal trade-off between IT robustness and computational privacy: For any robust...
متن کاملPervasive Secure Infrastructures ( PSI ) : Integrating
Seamless integration of smart sensors, wireless networks and mobile agents herald a new paradigm of real time information processing and exchange. At PSI, we are working on synergistic and frutful merging of disparate technologies with the utimate aim of providing a prevasive secured environment. As part of our initiative, we also envision in building a reconfigurable network appliance for mult...
متن کاملTwo-Round Secure MPC from Indistinguishability Obfuscation
One fundamental complexity measure of an MPC protocol is its round complexity. Asharov et al. recently constructed the first three-round protocol for general MPC in the CRS model. Here, we show how to achieve this result with only two rounds. We obtain UC security with abort against static malicious adversaries, and fairness if there is an honest majority. Additionally the communication in our ...
متن کاملPerfectly-Secure MPC with Linear Communication Complexity
Secure multi-party computation (MPC) allows a set of n players to securely compute an agreed function, even when up to t players are under the control of an adversary. Known perfectly secure MPC protocols require communication of at least Ω(n) field elements per multiplication, whereas cryptographic or unconditional security is possible with communication linear in the number of players. We pre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings on Privacy Enhancing Technologies
سال: 2022
ISSN: ['2299-0984']
DOI: https://doi.org/10.56553/popets-2022-0073